#include"priority_queue.h"

int main()
{
	priority_queue<int>pq;
	pq.push(12);
	pq.push(17);
	pq.push(2);
	pq.push(132);
	pq.push(2);
	pq.push(1);
	pq.push(142);
	pq.push(232);
	while (!pq.empty())
	{
		cout << pq.top() << ' ';
		pq.pop();
	}cout << endl;
	Solution::test01();
	Solution::Greater<int>a;
	cout<<a(12, 1);
	vector<int>v{ 1,34,5,325,3,6,0,0,78,1,5,5,9,2,95,2,3,21,6,5,43,3, };
	make_heap(v.begin(), v.end(),greater<int>());
	sort_heap(v.begin(), v.end(),greater<int>());
	for (auto num : v)cout << num << ' ';
	cout << endl;
	

	return 0;
}


